Image Segmentation With Modified K-Means Clustering Method

Image segmentation is used to recognizing some objects or something that is more meaningful and easier to analyze In this paper we are focus on the the K means clustering for segmentation of the image. K-means clustering is the most widely used clustering algorithm to position the radial basis function (RBF) centres. Its simplicity and ability to perform on-line clustering may inspire this choice. However, k-means clustering algorithm can be sensitive to the initial centres and the search for the optimum centre locations may result in poor local minima. Many attempts have been made to minimise these problems In this paper two updating rules were suggested as alternatives or improvements to the standard adaptive k-means clustering algorithm. The updating methods are proposed to give better overall RBF network performance rather than good clustering performance. However, there is a strong correlation between good clustering and the performance of the RBF network. The sensitivity of the RBF network to the centre locations will also be studied.Thus we will test the modified K means different set of images.